Termination proof of /tmp/tmpfcIwDq/PALINDROME_nosorts

Termination of the following Term Rewriting System could be disproven:

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

and(tt) → X
__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
isNePal(__(I, __(P, I))) → tt

↳ GTRS

  ↳ CritRuleProof

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

and(tt) → X
__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
isNePal(__(I, __(P, I))) → tt

The rule and(tt) → X contains free variables in its right-hand side. Hence the TRS is not-terminating.